Optimally one-sided bounded influence curves
نویسندگان
چکیده
We consider the problem of estimating a one-dimensional parameter θ in a smooth parametric model when deviations from the “true” θ have to be judged in an asymmetric way, because underestimation is no problem while overestimation is. In the infinitesimal robust setup, we solve a corresponding asymmetric problem for as. linear estimators Sn : min asVarid(Sn) s.t. supQn asBiasQn(Sn) ≤ b for some bound b and where the subscript id stands for evaluation in the ideal model, while in the side condition Qn ranges in some r/ √ n -shrinking neighborhood about the ideal model and only positive biases are taken into account. We solve this problem for convex-contamination-, for total-variation-, and Hellinger-neighborhoods. One-sided analoga to the mean squared error are introduced which give objective criteria for the choice of b depending only on the size of the neighborhood. The one-sided problems may be interpreted as limiting cases of the problem with asymmetric upper and lower bounds for the bias. Numerically, in the Gaussian location model, we compare the optimal one-sided clipped solutions to the corresponding two-sided clipped ones as to the one-sided criterium. We also address the problem of not knowing the neighborhood radius, translating the setup of Rieder et al. (2001) into ours.
منابع مشابه
Generalizations of Siegel’s and Picard’s Theorems
We prove new theorems that are higher-dimensional generalizations of the classical theorems of Siegel on integral points on affine curves and of Picard on holomorphic maps from C to affine curves. These include results on integral points over varying number fields of bounded degree and results on Kobayashi hyperbolicity. We give a number of new conjectures describing, from our point of view, ho...
متن کاملOn probabilistic pushdown automata
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than one-sided-error pda. Next one-sidederror pda are shown to be weaker than (nondeterministic) pda. Finally bounded error two-sided error pda and nondeterministic pda are incomparable. To show the li...
متن کاملMinimizing Crossings in Constrained Two-Sided Circular Graph Layouts
Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, oneand two-sided circular layouts are equivalent to one-page and two-pa...
متن کاملFilling an N-sided hole using combined subdivision schemes
A new algorithm is presented for filling n-sided holes. The algorithm generates a subdivision surface which connects smoothly (G) with the surface around the hole. The data to the algorithm consists of n boundary curves and cross boundary derivatives, given in any parametric form. The algorithm is based on Sabin’s variant of CatmullClark scheme [1], which operates in the surface interior. Near ...
متن کاملNorm Inequalities Relating One-sided Singular Integrals and the One-sided Maximal Function
In this paper we prove that if a weight w satisfies the C q condition, then the Lp(w) norm of a one-sided singular integral is bounded by the Lp(w) norm of the one-sided Hardy-Littlewood maximal function, for 1 < p < q <∞.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005